1,673 research outputs found
Strong converse for the quantum capacity of the erasure channel for almost all codes
A strong converse theorem for channel capacity establishes that the error
probability in any communication scheme for a given channel necessarily tends
to one if the rate of communication exceeds the channel's capacity.
Establishing such a theorem for the quantum capacity of degradable channels has
been an elusive task, with the strongest progress so far being a so-called
"pretty strong converse". In this work, Morgan and Winter proved that the
quantum error of any quantum communication scheme for a given degradable
channel converges to a value larger than in the limit of many
channel uses if the quantum rate of communication exceeds the channel's quantum
capacity. The present paper establishes a theorem that is a counterpart to this
"pretty strong converse". We prove that the large fraction of codes having a
rate exceeding the erasure channel's quantum capacity have a quantum error
tending to one in the limit of many channel uses. Thus, our work adds to the
body of evidence that a fully strong converse theorem should hold for the
quantum capacity of the erasure channel. As a side result, we prove that the
classical capacity of the quantum erasure channel obeys the strong converse
property.Comment: 15 pages, submission to the 9th Conference on the Theory of Quantum
Computation, Communication, and Cryptography (TQC 2014
Strong converse for the classical capacity of the pure-loss bosonic channel
This paper strengthens the interpretation and understanding of the classical
capacity of the pure-loss bosonic channel, first established in [Giovannetti et
al., Physical Review Letters 92, 027902 (2004), arXiv:quant-ph/0308012]. In
particular, we first prove that there exists a trade-off between communication
rate and error probability if one imposes only a mean-photon number constraint
on the channel inputs. That is, if we demand that the mean number of photons at
the channel input cannot be any larger than some positive number N_S, then it
is possible to respect this constraint with a code that operates at a rate
g(\eta N_S / (1-p)) where p is the code's error probability, \eta\ is the
channel transmissivity, and g(x) is the entropy of a bosonic thermal state with
mean photon number x. We then prove that a strong converse theorem holds for
the classical capacity of this channel (that such a rate-error trade-off cannot
occur) if one instead demands for a maximum photon number constraint, in such a
way that mostly all of the "shadow" of the average density operator for a given
code is required to be on a subspace with photon number no larger than n N_S,
so that the shadow outside this subspace vanishes as the number n of channel
uses becomes large. Finally, we prove that a small modification of the
well-known coherent-state coding scheme meets this more demanding constraint.Comment: 18 pages, 1 figure; accepted for publication in Problems of
Information Transmissio
Detection of Leptosphaeria maculans races on winter oilseed rape in different geographic regions of Germany and efficacy of monogenic resistance genes under varying temperatures
Final Published versio
Strong converse rates for quantum communication
We revisit a fundamental open problem in quantum information theory, namely
whether it is possible to transmit quantum information at a rate exceeding the
channel capacity if we allow for a non-vanishing probability of decoding error.
Here we establish that the Rains information of any quantum channel is a strong
converse rate for quantum communication: For any sequence of codes with rate
exceeding the Rains information of the channel, we show that the fidelity
vanishes exponentially fast as the number of channel uses increases. This
remains true even if we consider codes that perform classical post-processing
on the transmitted quantum data. As an application of this result, for
generalized dephasing channels we show that the Rains information is also
achievable, and thereby establish the strong converse property for quantum
communication over such channels. Thus we conclusively settle the strong
converse question for a class of quantum channels that have a non-trivial
quantum capacity.Comment: v4: 13 pages, accepted for publication in IEEE Transactions on
Information Theor
Fundamental limits on key rates in device-independent quantum key distribution
In this paper, we introduce intrinsic non-locality as a quantifier for Bell
non-locality, and we prove that it satisfies certain desirable properties such
as faithfulness, convexity, and monotonicity under local operations and shared
randomness. We then prove that intrinsic non-locality is an upper bound on the
secret-key-agreement capacity of any device-independent protocol conducted
using a device characterized by a correlation . We also prove that intrinsic
steerability is an upper bound on the secret-key-agreement capacity of any
semi-device-independent protocol conducted using a device characterized by an
assemblage . We also establish the faithfulness of intrinsic
steerability and intrinsic non-locality. Finally, we prove that intrinsic
non-locality is bounded from above by intrinsic steerability.Comment: 44 pages, 4 figures, final version accepted for publication in New
Journal of Physic
Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
A strong converse theorem for the classical capacity of a quantum channel
states that the probability of correctly decoding a classical message converges
exponentially fast to zero in the limit of many channel uses if the rate of
communication exceeds the classical capacity of the channel. Along with a
corresponding achievability statement for rates below the capacity, such a
strong converse theorem enhances our understanding of the capacity as a very
sharp dividing line between achievable and unachievable rates of communication.
Here, we show that such a strong converse theorem holds for the classical
capacity of all entanglement-breaking channels and all Hadamard channels (the
complementary channels of the former). These results follow by bounding the
success probability in terms of a "sandwiched" Renyi relative entropy, by
showing that this quantity is subadditive for all entanglement-breaking and
Hadamard channels, and by relating this quantity to the Holevo capacity. Prior
results regarding strong converse theorems for particular covariant channels
emerge as a special case of our results.Comment: 33 pages; v4: minor changes throughout, accepted for publication in
Communications in Mathematical Physic
Quantum state cloning using Deutschian closed timelike curves
We show that it is possible to clone quantum states to arbitrary accuracy in
the presence of a Deutschian closed timelike curve (D-CTC), with a fidelity
converging to one in the limit as the dimension of the CTC system becomes
large---thus resolving an open conjecture from [Brun et al., Physical Review
Letters 102, 210402 (2009)]. This result follows from a D-CTC-assisted scheme
for producing perfect clones of a quantum state prepared in a known eigenbasis,
and the fact that one can reconstruct an approximation of a quantum state from
empirical estimates of the probabilities of an informationally-complete
measurement. Our results imply more generally that every continuous, but
otherwise arbitrarily non-linear map from states to states can be implemented
to arbitrary accuracy with D-CTCs. Furthermore, our results show that Deutsch's
model for CTCs is in fact a classical model, in the sense that two arbitrary,
distinct density operators are perfectly distinguishable (in the limit of a
large CTC system); hence, in this model quantum mechanics becomes a classical
theory in which each density operator is a distinct point in a classical phase
space.Comment: 6 pages, 1 figure; v2: modifications to the interpretation of our
results based on the insightful comments of the referees; v3: minor change,
accepted for publication in Physical Review Letter
Extendibility limits the performance of quantum processors
Resource theories in quantum information science are helpful for the study
and quantification of the performance of information-processing tasks that
involve quantum systems. These resource theories also find applications in
other areas of study; e.g., the resource theories of entanglement and coherence
have found use and implications in the study of quantum thermodynamics and
memory effects in quantum dynamics. In this paper, we introduce the resource
theory of unextendibility, which is associated to the inability of extending
quantum entanglement in a given quantum state to multiple parties. The free
states in this resource theory are the -extendible states, and the free
channels are -extendible channels, which preserve the class of
-extendible states. We make use of this resource theory to derive
non-asymptotic, upper bounds on the rate at which quantum communication or
entanglement preservation is possible by utilizing an arbitrary quantum channel
a finite number of times, along with the assistance of -extendible channels
at no cost. We then show that the bounds we obtain are significantly tighter
than previously known bounds for both the depolarizing and erasure channels.Comment: 39 pages, 6 figures, v2 includes pretty strong converse bounds for
antidegradable channels, as well as other improvement
Strong converse for the classical capacity of optical quantum communication channels
We establish the classical capacity of optical quantum channels as a sharp
transition between two regimes---one which is an error-free regime for
communication rates below the capacity, and the other in which the probability
of correctly decoding a classical message converges exponentially fast to zero
if the communication rate exceeds the classical capacity. This result is
obtained by proving a strong converse theorem for the classical capacity of all
phase-insensitive bosonic Gaussian channels, a well-established model of
optical quantum communication channels, such as lossy optical fibers, amplifier
and free-space communication. The theorem holds under a particular
photon-number occupation constraint, which we describe in detail in the paper.
Our result bolsters the understanding of the classical capacity of these
channels and opens the path to applications, such as proving the security of
noisy quantum storage models of cryptography with optical links.Comment: 15 pages, final version accepted into IEEE Transactions on
Information Theory. arXiv admin note: text overlap with arXiv:1312.328
- …